Your selections:
Local search-based approach for cost-effective job assignment on large language models
- Liu, Yueyue, Zhang, Hongyu, Le, Van-Hoang, Miao, Yuantian, Li, Zhiqiang
Constraint based local search for flowshops with sequence-dependent setup times
- Riahi, Vahid, Newton, M. A. Hakim, Sattar, Abdul
LS-sampling: An effective local search based sampling approach for achieving high t-wise coverage
- Luo, Chuan, Sun, Binqi, Qiao, Bo, Chen, Junjie, Zhang, Hongyu, Lin, Jinkun, Lin, Qingwei, Zhang, Dongmei
An effective memetic algorithm for multi-objective job-shop scheduling
- Gong, Guiliang, Deng, Qianwang, Chiong, Raymond, Gong, Xuran, Huang, Hezhiyuan
Towards More Efficient Meta-heuristic Algorithms for Combinatorial Test Generation
- Lin, Jinkun, Cai, Shaowei, Luo, Chuan, Lin, Qingwei, Zhang, Hongyu
- Cotta, Carlos, Mathieson, Luke, Moscato, Pablo
Scheduling arc maintenance jobs in a network to maximise total flow over time
- Boland, Natashia, Kalinowski, Thomas, Waterer, Hamish, Zheng, Lanbo
- Hewitt, Mike, Nemhauser, George, Savelsbergh, Martin W. P.
Cellular Differential Evolution algorithm
- Noman, Nasimul, Iba, Hitoshi
Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem
- Hewitt, Mike, Nemhauser, George L., Savelsbergh, Martin W. P.
- Keysan, Gizem, Nemhauser, George L., Savelsbergh, Martin W. P.
Memetic algorithms for solving job-shop scheduling problems
- Hasan, S. M. Kamrul, Sarker, Ruhul, Essam, Daryl, Cornforth, David
Are you sure you would like to clear your session, including search history and login status?